A generalization of a second irreducibility theorem of I. Schur
نویسندگان
چکیده
in which cases either f(x) is irreducible or f(x) is the product of two irreducible polynomials of equal degree. If |an| = n > 1, then for some choice of a1, . . . , an−1 ∈ Z and a0 = ±1, we have that f(x) is reducible. I. Schur (in [8]) obtained this result in the special case that an = ±1. Further results along the nature of Theorem 1 are also discussed in [6]. The purpose of this paper is to establish a generalization of a second theorem of I. Schur. Namely, we prove
منابع مشابه
A Generalization of an Irreducibility Theorem of I. Schur
is irreducible. Irreducibility here and throughout this paper refers to irreducibility over the rationals. Some condition, such as ja0j = janj = 1, on the integers aj is necessary; otherwise, the irreducibility of all polynomials of the form above would imply every polynomial inZ[x] is irreducible (which is clearly not the case). In this paper, we will mainly be interested in relaxing the condi...
متن کاملTheorems of Sylvester and Schur
An old theorem of Sylvester states that a product of k consecutive positive integers each exceeding k is divisible by a prime greater than k. We shall give a proof of this theorem and apply it to prove a result of Schur on the irreducibility of certain polynomials.
متن کاملHilbert’s Irreducibility Theorem and the Larger Sieve
We describe an explicit version of Hilbert’s irreducibility theorem using a generalization of Gallagher’s larger sieve. We give applications to the Galois theory of random polynomials, and to the images of the adelic representation associated to elliptic curves varying in rational families.
متن کاملA GENERALIZATION OF A JACOBSON’S COMMUTATIVITY THEOREM
In this paper we study the structure and the commutativity of a ring R, in which for each x,y ? R, there exist two integers depending on x,y such that [x,y]k equals x n or y n.
متن کامل